Iterative Decoding Algorithms for I-Q Space-Time Codes
نویسنده
چکیده
I-Q ST codes have shown the potential to provide high coding gains in rapid fading environments. The optimal decoding of I-Q ST codes involves the use of the super-trellis of the I and Q codes, which is complex in general. This paper proposes two iterative decoding algorithms for I-Q ST codes. The proposed algorithms have similar performance to optimal decoding with much lower complexity.
منابع مشابه
Performance analysis and iterative decoding of I-Q trellis space-time codes
I-Q trellis codes are known to increase the time diversity of coded systems.When I-Q codes are used with multiple transmit antennas, the decoding and performance evaluation requires the construction of the high-complexity super-trellis of the component codes. In the paper, the bit error probability and the design criteria of I-Q space-time (ST) codes are derived using the transfer functions of ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملA Decoding Algorithm for I-Q Space-Time Coded Systems in Fading Environments
This paper presents the decoding of the I-Q Space-Time (Sg codes. In this paper, the decoding problem of I-Q ST codes is formulated. The use of the super-trellis to solve the decoding problem results in an increased decoding complexity. Therefore, a simplijied decoding algorithm is proposed. It is based on symbol-by-symbol detection of the Q/I components in the L'Q decoders. Simulation results ...
متن کاملArray processing for simplified turbo decoding of interleaved space-time codes
Space-time coded architectures that deploy multiple transmit-receive antennas with interleaved space-time codes are considered. Decoding is based on the iterative concatenation of a demapping stage with a decoding stage. We describe several simplified demapping algorithms based on array processing methods that can include either soft or hard feedback information. These algorithms are particular...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004